runtime.pageAlloc.summary (field)

32 uses

	runtime (current package)
		mgcscavenge.go#L755: 	if p.summary[len(p.summary)-1][ci].max() >= uint(minPages) {
		mpagealloc.go#L202: 	summary [summaryLevels][]pallocSum
		mpagealloc.go#L496: 		x := p.summary[len(p.summary)-1][sc]
		mpagealloc.go#L501: 		p.summary[len(p.summary)-1][sc] = y
		mpagealloc.go#L505: 		summary := p.summary[len(p.summary)-1]
		mpagealloc.go#L512: 		whole := p.summary[len(p.summary)-1][sc+1 : ec]
		mpagealloc.go#L532: 		summary := p.summary[len(p.summary)-1]
		mpagealloc.go#L540: 	for l := len(p.summary) - 2; l >= 0 && changed; l-- {
		mpagealloc.go#L554: 			children := p.summary[l+1][i<<logEntriesPerBlock : (i+1)<<logEntriesPerBlock]
		mpagealloc.go#L556: 			old := p.summary[l][i]
		mpagealloc.go#L559: 				p.summary[l][i] = sum
		mpagealloc.go#L732: 	for l := 0; l < len(p.summary); l++ {
		mpagealloc.go#L742: 		entries := p.summary[l][i : i+entriesPerBlock]
		mpagealloc.go#L847: 		sum := p.summary[len(p.summary)-1][i]
		mpagealloc.go#L848: 		print("runtime: summary[", len(p.summary)-1, "][", i, "] = (", sum.start(), ", ", sum.max(), ", ", sum.end(), ")\n")
		mpagealloc.go#L890: 		if max := p.summary[len(p.summary)-1][i].max(); max >= uint(npages) {
		mpagealloc_64bit.go#L86: 		p.summary[l] = *(*[]pallocSum)(unsafe.Pointer(&sl))
		mpagealloc_64bit.go#L120: 		base := unsafe.Pointer(&p.summary[level][0])
		mpagealloc_64bit.go#L147: 	for l := range p.summary {
		mpagealloc_64bit.go#L155: 		if needIdxLimit > len(p.summary[l]) {
		mpagealloc_64bit.go#L156: 			p.summary[l] = p.summary[l][:needIdxLimit]
		mpagecache.go#L130: 	if p.summary[len(p.summary)-1][ci] != 0 {